Termination Casts: A Flexible Approach to Termination with General Recursion
نویسندگان
چکیده
منابع مشابه
Termination Casts: A Flexible Approach to Termination with General Recursion
This paper proposes a type-and-effect system called Teq↓, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambda calculus with general recursion and equality types. The central idea is to include a primitive type-form “Terminates t”, expressing that term t is terminating; and then allow terms t to be coerced from possibly dive...
متن کاملProving Termination of Unfolding Graph Rewriting for General Safe Recursion
In this paper we present a new termination proof and complexity analysis of unfolding graph rewriting which is a specific kind of infinite graph rewriting expressing the general form of safe recursion. We introduce a termination order over sequences of terms together with an interpretation of term graphs into sequences of terms. Unfolding graph rewrite rules expressing general safe recursion ca...
متن کاملA theory of function-induced-orders to study recursion termination
Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus obtained, is shown to look like a forest of trees, with a possible base set and a generator set (defined in the paper). ‘Isomorphic forests’ may arise for differ...
متن کاملTermination of Pregnancy with Prostaglandin
تاثیر تزریق داخل رحمی apGF2 و تزریق داخل وریدی اکسی توسین به عنوان دو روش درمانی در ختم حاملگی، در زنانی که در سه ماهه دوم بارداری دچار پارگی کیسه آب بودند، با یک دیگر مقایسه شده اند.
متن کاملAutomated Termination Proofs Using Walther Recursion
In this thesis, I present an improved method for automatic proofs of termination through a syntactic measurement of sizing that was first developed by Walther. We discuss formal requirements for proving termination using this method and how it can be generalized to other languages. We present a simple set-theoretic language as an example which can be used to write basic Lisp-like programs. Usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.43.6